Black boxes and modifiable exposures

Online strip packing with modifiable boxes

Black Boxes

The non-structure theorems we have discussed in Chapter III rests usually on some freedom on finite sequences and on a kind of order. When our freedom is related to infinite sequences, and to trees, our work is sometimes harder. In particular, we may consider, for λ ≥ χ, χ regular, and φ = φ(x̄0, . . . , x̄α, . . .)α<χ in a vocabulary τ : (∗) For any I ⊆ λ we have a τ–modelMI and sequences āη (fo...

Black Boxes, Incorporated

The term “Black Box” often refers to a device whose functionality we understand, but whose inner workings we don’t, or choose to ignore. This term appears a lot in a large variety of contexts within theoretical computer science, and happens to be extremely convenient to capture computations with restricted knowledge about or access to certain information. In its most basic form, a black box (al...

Windows on Black Boxes ?

This paper provides an overview of the survey-based literature on industrial Research and Development (R&D) laboratories, beginning with the work of Edwin Mansfield. Topics covered include R&D projects, new products, and new processes; the appropriability of intellectual property; the limits of the firm in R&D; and spillovers of knowledge from other firms and universities into the laboratories....

Verifying Designs Containing Black Boxes

We deene a notion of equivalence for designs containing black boxes. This notion is applicable to both gate-level designs, as well as designs operating on integer variables. Using this notion, we describe a sound and complete methodology for optimizing designs containing black boxes, i.e. components whose functionality is not known; these arise naturally in the course of hierarchical design.